Feature selection parallelization based on priority queue
نویسندگان
چکیده
منابع مشابه
Priority Queue Based Path Selection Using Pqmr Protocol in Manet
MANET (Mobile Ad hoc Network) comprises of several mobile nodes connected by wireless links that creates this network as self-configuring and is also called as Mobile Mesh Networks. The Ad hoc networks are a novel wireless networking prototype for mobile nodes and compared with traditional networks it does not possess any existing or fixed network infrastructure. Rather the mobile nodes rely on...
متن کاملRealistic Parallel Algorithms : Priority Queue Operationsand Selection
In this paper, we explore parallel implementations of the abstract data type priority queue. We use the BSP* model, an extension of Valiant's BSP model which rewards blockwise communication, i.e. sending a few large messages instead of many small ones. We present two randomized approaches for diierent relations between the size of the data structure and the number of parallel updates to be perf...
متن کاملPriority Queue Based on Multilevel Prefix Tree
Tree structures are very often used data structures. Among ordered types of trees there are many variants whose basic operations such as insert, delete, search, delete-min are characterized by logarithmic time complexity. In the article I am going to present the structure whose time complexity for each of the above operations is O( K + K), where M is the size of data type and K is constant prop...
متن کاملQueue-based priority MAC for WLANs
Recent studies have shown that it is possible to approximate throughput optimal scheduling using distributed Carrier Sense Multiple Access (CSMA). These studies build on the idea of maximal-weight scheduling, where the set of links scheduled in each slot are the non-conflicting links with maximum sum of their queue lengths. However, conditions imposed by real environments including imperfect ca...
متن کاملMSL Based Concurrent and Efficient Priority Queue
Priority queues are fundamental in the design of modern multiprocessor algorithms. Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or branch-and-bound. This paper proposes an alternative approach: to base the design of concurrent priority queues on the Modified Skip List data structure. To this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific and Technical Journal of Information Technologies, Mechanics and Optics
سال: 2017
ISSN: 2226-1494
DOI: 10.17586/2226-1494-2017-17-4-664-669